Counting connected components of a semialgebraic set in subexponential time
نویسندگان
چکیده
منابع مشابه
Description of the Connected Components of a Semialgebraic in Single Exponential Time
This paper is devoted to the following result: let R be a real closed field and S a semialgebraic subset of R defined by a boolean combination of polynomial inequalities. Let D be the sum of the degrees of the polynomials involved. Then it is possible to find algorithmically a description of the semialgebraically connected components of S in sequential time D O(1) and parallel time (n log D). T...
متن کاملCounting Models Using Connected Components
Recent work by Birnbaum & Lozinskii [1999] demonstrated that a clever yet simple extension of the well-known DavisPutnam procedure for solving instances of propositional satisfiability yields an efficient scheme for counting the number of satisfying assignments (models). We present a new extension, based on recursively identifying connected constraint-graph components, that substantially improv...
متن کاملCounting the Number of Connected Components of a Set and Its Application to Robotics
This paper gives a numerical algorithm able to compute the number of path-connected components of a set S defined by nonlinear inequalities. This algorithm uses interval analysis to create a graph which has the same number of connected components as S. An example coming from robotics is presented to illustrate the interest of this algorithm for path-planning.
متن کاملCounting Connected Set Partitions of Graphs
Let G = (V,E) be a simple undirected graph with n vertices then a set partition π = {V1, . . . , Vk} of the vertex set of G is a connected set partition if each subgraph G[Vj ] induced by the blocks Vj of π is connected for 1 ≤ j ≤ k. Define qi(G) as the number of connected set partitions in G with i blocks. The partition polynomial is Q(G,x) = ∑n i=0 qi(G)x . This paper presents a splitting ap...
متن کاملPeeling the Cactus: Subexponential-Time Algorithms for Counting Triangulations∗
Given a set of n points S in the plane, a triangulation T of S is a maximal set of non-crossing segments with endpoints in S. We present an algorithm that computes the number of triangulations on a given set of n points in time n √ , significantly improving the previous best running time of O(2n) by Alvarez and Seidel [SoCG 2013]. Our main tool is identifying separators of size O( √ n) of a tri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 1992
ISSN: 1016-3328,1420-8954
DOI: 10.1007/bf01202001